Lower bounds on the F-pure threshold and extremal singularities

نویسندگان

چکیده

We prove that if f f is a reduced homogeneous polynomial of degree alttext="d"> d encoding="application/x-tex">d , then its alttext="upper F"> F encoding="application/x-tex">F -pure threshold at the unique maximal ideal least alttext="StartFraction 1 Over d minus EndFraction"> 1 − encoding="application/x-tex">\frac {1}{d-1} . show, furthermore, equals and only alttext="f element-of German m Superscript left-bracket q right-bracket"> ∈<!-- ∈ <mml:msup> m [ q stretchy="false">] encoding="application/x-tex">f\in \mathfrak m^{[q]} alttext="d plus 1"> = + encoding="application/x-tex">d=q+1 where alttext="q"> encoding="application/x-tex">q power alttext="p"> p encoding="application/x-tex">p Up to linear changes coordinates (over fixed algebraically closed field), we classify such “extremal singularities”, show there most one with isolated singularity. Finally, indicate several ways in which projective hypersurfaces defined by forms are “extremal”, for example, terms configurations lines they can contain.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Threshold circuit lower bounds on cryptographic functions

In this work, we are interested in non-trivial upper bounds on the spectral norm of binary matrices M from {−1, 1}N×N . It is known that the distributed Boolean function represented by M is hard to compute in various restricted models of computation if the spectral norm is bounded from above by N1−ε, where ε > 0 denotes a fixed constant. For instance, the size of a two-layer threshold circuit (...

متن کامل

Lower Bounds on Estimator Error and the Threshold Effect

Rather than compute the exact error of a specific estimator, it is often more convenient to apply results which lower-bound the error of any estimator for a given problem. We present three such bounds and illustrate their applications to signal parameter estimation. The Cramèr-Rao bound is simple to compute and approximates the actual error under conditions of high signal-to-noise ratio. Howeve...

متن کامل

Improved lower bounds on extremal functions of multidimensional permutation matrices

A d-dimensional zero-one matrix A avoids another d-dimensional zero-one matrix P if no submatrix of A can be transformed to P by changing some ones to zeroes. Let f(n, P, d) denote the maximum number of ones in a d-dimensional n × · · · × n zero-one matrix that avoids P . Fox proved for n sufficiently large that f(n, P, 2) = 2k Θ(1) n for almost all k × k permutation matrices P . We extend this...

متن کامل

Algorithms and Lower Bounds for Threshold Circuits

A fundamental purpose of theory of computation is to understand differences between uniform computation and nonuniform one. In particular, Boolean circuit has been studied in an area of nonuniform computation models, because Boolean circuits are natural formalization of computer architecture and hardware. Boolean circuit is compared with uniform computation expressed as fixed size programs whic...

متن کامل

Lower bounds on threshold and related circuits via communication complexity

Communication-complexity definitions and arguments are used to derive linear (Q(n)) and almost-linear (Q(n/ log n)) lower bounds on the size of circuits implementing certain functions. The techniques utilize only basic features of the gates used and of the functions implemented hence apply to a large class of gates (including unbounded fan-in AND/OR, threshold, symmetric, and generalized symmet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 2022

ISSN: ['2330-0000']

DOI: https://doi.org/10.1090/btran/106